package com.lwx.leetcode.list;

public class Offer36 {
    public Node treeToDoublyList(Node root) {
        //二叉搜索树，中序遍历
        return null;

    }

    class Node {
        public int val;
        public Node left;
        public Node right;

        public Node() {}

        public Node(int _val) {
            val = _val;
        }

        public Node(int _val,Node _left,Node _right) {
            val = _val;
            left = _left;
            right = _right;
        }
    }
}
